Stop-Line and Crosswalk Detection Based on Blob-Coloring
نویسندگان
چکیده
منابع مشابه
Obstacle Detection Based on Color Blob Flow
In this paper we present a new robust approach to extract moving objects in traffic scenes. It allows moving obstacles (cars, motorcycles, ...) to be detected from a moving car without any a priori information about the shape or location of these moving objects. This technique is based on the concept of tracking color blobs in image sequences.
متن کاملAutomatic Service Composition Based on Graph Coloring
Web services as independent software components are published on the Internet by service providers and services are then called by users’ request. However, in many cases, no service alone can be found in the service repository that could satisfy the applicant satisfaction. Service composition provides new components by using an interactive model to accelerate the programs. Prior to service comp...
متن کاملAutomatic Service Composition Based on Graph Coloring
Web services as independent software components are published on the Internet by service providers and services are then called by users’ request. However, in many cases, no service alone can be found in the service repository that could satisfy the applicant satisfaction. Service composition provides new components by using an interactive model to accelerate the programs. Prior to service comp...
متن کاملOn-Line Coloring and Recursive Graph Theory
An on-line vertex coloring algorithm receives the vertices of a graph in some externally determined order, and, whenever a new vertex is presented, the algorithm also learns to which of the previously presented vertices the new vertex is adjacent. As each vertex is received, the algorithm must make an irrevocable choice of a color to assign the new vertex, and it makes this choice without knowl...
متن کاملParallel and On-Line Graph Coloring
We discover a surprising connection between graph coloring in two orthogonal paradigms: parallel and on-line computing. We present a randomized on-line coloring algorithm with a performance ratio of O(n= log n), an improvement of p log n factor over the previous best known algorithm of Vishwanathan. Also, from the same principles, we construct a parallel coloring algorithm with the same perform...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Institute of Control, Robotics and Systems
سال: 2011
ISSN: 1976-5622
DOI: 10.5302/j.icros.2011.17.8.799